Constructive Negation and Constraints
نویسنده
چکیده
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, Constraint Logic Programming (CLP) is offering a different approach called constructive negation, that is becoming more popular. In this paper we present a constructive approach to negation in logic programs. We concentrate on implementation aspects of constructive negation here, i.e., on the design of CLP(H ) system, where H is the Herbrand Universe.
منابع مشابه
Constructive Negation in CLP(H)
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, with the spre...
متن کاملCompiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an ‘active’ role. In this paper we analyze an extension of the original constructive negation in order to gracefully integrate with the management of set-constraints in the context of a Constraint Logic Programming Language dealing with finite sets. W...
متن کاملNegation and Constraint Logic Programming
Almost all constraint logic programming systems include negation, yet nowhere has a sound operational model for negation in CLP been discussed. The SLDNF approach of only allowing ground negative subgoals to execute is very restrictive in constraint logic programming where most variables appearing in a derivation never become ground. By describing a scheme for constructive negation in constrain...
متن کاملConstructive Negation Under the Well-Founded Semantics
Constructive negation derives constraint answers for non-ground negative literals. Its incorporation into query evaluation under the well-founded semantics introduces two problems. One is the detection of repeated sub-goals and the elimination of redundant answers, which is required in order to guarantee termination. The other is the interaction between constraint answers of non-ground negative...
متن کاملResolution, Constructive Negation, and Abduction over Finite Domains in Higher-order Constraint Programming
Constraint-based environments often avoid the complex task of general theorem proving and focus on a well-behaved logical sublanguage. Reintro-duction of the more general facilities is a promising eeort as constraints are now much more eeciently dealt with than in most pure theorem provers and the constraint calculus itself gains expressivity. This paper discusses programming techniques develop...
متن کامل